On the Number of t-Ary Trees with a Given Path Length
نویسندگان
چکیده
منابع مشابه
1 5 Se p 20 05 On the number of t - ary trees with a given path length
We show that the number of t-ary trees with path length equal to p is exp ( h(t−1)t log t p log p (1 + o(1)) ) , where h(x)=−x log x−(1−x) log(1−x) is the binary entropy function. Besides its intrinsic combinatorial interest, the question recently arose in the context of information theory, where the number of t-ary trees with path length p estimates the number of universal types, or, equivalen...
متن کاملOn the Average Path Length of Complete m-ary Trees
Define the average path length in a connected graph as the sum of the length of the shortest path between all pairs of nodes, divided by the total number of pairs of nodes. Letting SN denote the sum of the shortest path lengths between all pairs of nodes in a complete m-ary tree of depth N , we derive a first-order linear but non-homogeneous recurrence relation for SN , from which a closed-form...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملNote on the Weighted Internal Path Length of b-ary Trees
In a recent paper Broutin and Devroye (2005) have studied the height of a class of edge-weighted random trees. This is a class of trees growing in continuous time which includes many well known trees as examples. In this paper we derive a limit theorem for the internal path length for this class of trees. The application of this limit theorem to concrete examples depends upon the possibility to...
متن کاملON THE EXTERNAL PATH LENGTH OF RANDOM RECURSIVE k-ARY TREES
In this paper, we determine the expectation and variance of Xn the external path length in a random recursive k-ary tree of size n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2006
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-006-0122-8